/**
 * LCR 068. 搜索插入位置
 * https://leetcode.cn/problems/N6YdxV/description/
 */
class Solution {
    public int searchInsert(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while(left < right) {
            int mid = left + (right - left) / 2;
            if(nums[mid] < target) left = mid + 1;
            else right = mid;
        }
        //特判
        if(nums[right] < target) return right + 1;
        return right;
    }
}